Locally s-distance transitive graphs
نویسندگان
چکیده
We give a unified approach to analysing, for each positive integer s, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally s-arc transitive graphs of diameter at least s. A graph is in the class if it is connected and if, for each vertex v, the subgroup of automorphisms fixing v acts transitively on the set of vertices at distance i from v, for each i from 1 to s. We prove that this class is closed under forming normal quotients. Several graphs in the class are designated as degenerate, and a nondegenerate graph in the class is called basic if all its nontrivial normal quotients are degenerate. We prove that, for s ≥ 2, a nondegenerate, nonbasic graph in the class is either a complete multipartite graph, or a normal cover of a basic graph. We prove further that, apart from the complete bipartite graphs, each basic graph admits a faithful quasiprimitive action on each of its (1 or 2) vertex orbits, or a biquasiprimitive action. These results invite detailed additional analysis of the basic graphs using the theory of quasiprimitive permutation groups.
منابع مشابه
k-CS-transitive infinite graphs
a r t i c l e i n f o a b s t r a c t A graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic induced subgraphs A and B of Γ , each of size k, there is an automorphism of Γ taking A to B. The graph is called k-CS-homogeneous if any isomorphism between two connected induced subgraphs of size k extends to an automor-phism. We consider locally-finite infinite k-...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملThe locally 2-arc transitive graphs admitting an almost simple group of Suzuki type
A graph Γ is said to be locally (G, 2)-arc transitive for G a subgroup of Aut(Γ) if, for any vertex α of Γ, G is transitive on the 2-arcs of Γ starting at α. In this talk, we will discuss general results involving locally (G, 2)-arc transitive graphs and recent progress toward the classification of the locally (G, 2)-arc transitive graphs, where Sz(q) ≤ G ≤ Aut(Sz(q)), q = 2 for some k ∈ N. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 69 شماره
صفحات -
تاریخ انتشار 2012